Decorated proofs for computational effects: States
نویسندگان
چکیده
Abstract. The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs about an imperative language may hide the state, in the same way as the syntax does. The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs about an imperative language may hide the state, in the same way as the syntax does.
منابع مشابه
Computational studies of carbon decorated boron nitride nanocones
Density functional theory ,(DFT) calculations have been performed to investigate the properties ofcarbon decorated (C-decorated) models of boron nitride (BN) nanocones. To this aim, the apex andtip of nanocone have been substituted by the carbon atoms to represent the C-decorated models. Theresults indicated that dipole moments and energy gaps could reveal the effects of C-decorations onthe pro...
متن کاملIMP with exceptions over decorated logic
In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations” that describe what computational (side) effect evaluation of a term may involve. In a point-free categorical language, called the “decorated logic”, we formalize the mutable state and the exception effects first separately, and then combined, exploiting a nice duality between th...
متن کاملDecorated proofs for computational effects: Exceptions
We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This proof system is sound with respect to the intended denotational semantics of exceptions. With this inference system we prove several properties of exceptions.
متن کاملFinal Semantics for Decorated Traces
In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [13], we give a c...
متن کاملCertification of programs with computational effects
In purely functional programming languages imperative features, more generally computational effects are prohibited. However, non-functional languages do involve effects. The theory of decorated logic provides a rigorous formalism (with a refinement in operation signatures) for proving program properties with respect to computational effects. The aim of this thesis is to first develop Coq libra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011